Constructing Control Lyapunov Functions from Polyhedral Controllable Sets using Frank-Wolfe Algorithm
نویسندگان
چکیده
منابع مشابه
An Algorithm for Constructing Lyapunov Functions
In this monograph we develop an algorithm for constructing Lyapunov functions for arbitrary switched dynamical systems ẋ = fσ(t,x), possessing a uniformly asymptotically stable equilibrium. Let ẋ = fp(t,x), p ∈ P, be the collection of the ODEs, to which the switched system corresponds. The number of the vector fields fp on the right-hand side of the differential equation is assumed to be finite...
متن کاملMarginal Inference in MRFs using Frank-Wolfe
We introduce an algorithm, based on the Frank-Wolfe technique (conditional gradient), for performing marginal inference in undirected graphical models by repeatedly performing MAP inference. It minimizes standard Bethe-style convex variational objectives for inference, leverages known MAP algorithms as black boxes, and offers a principled means to construct sparse approximate marginals for high...
متن کاملContinuous control-Lyapunov functions for asymptotically controllable time-varying systems
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملFunctional Frank-Wolfe Boosting for General Loss Functions
Boosting is a generic learning method for classification and regression. Yet, as the number of base hypotheses becomes larger, boosting can lead to a deterioration of test performance. Overfitting is an important and ubiquitous phenomenon, especially in regression settings. To avoid overfitting, we consider using l1 regularization. We propose a novel Frank-Wolfe type boosting algorithm (FWBoost...
متن کاملA Deterministic Nonsmooth Frank Wolfe Algorithm with Coreset Guarantees
We present a new Frank-Wolfe (FW) type algorithm that is applicable to minimization problems with a nonsmooth convex objective. We provide convergence bounds and show that the scheme yields so-called coreset results for various Machine Learning problems including 1-median, Balanced Development, Sparse PCA, Graph Cuts, and the `1-norm-regularized Support Vector Machine (SVM) among others. This m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.11.371